Skip to main content

Basic Definitions of Mappings

Mapping and Domain

UU be a set such that UEU\subseteq E The relation ff is said mapping when uU:!wFf(u)=w\forall u\in U : \exists!w\in F \ni`f(u)=w Said domain and is indicated with dom(f)dom(f)

A vector ww such that w=f(u)w=f(u) is said to be the mapped (or transformed) of uu through ff

Image

Image (ImIm) is a set of all all vectors ww that exist such that f(u)=wf(u)=w Im(f)={wFuEf(u)=w}Im(f)=\{w\in F | \exist u\in E\ni`f(u)=w\}

dom/domain = Input Image = output \to also means a subset

Surjective, injective, bijective

Mapping ff is surjective if the image of ff coincides with F:Im(f)=FF:Im(f)=F

Mapping ff is injective if u,vE\forall u,v \in E with f(u)=f(v)u=vf(u)=f(v)\to u=v (if uu is different from vv, then so will f(u)/f(v)f(u)/f(v))

Mapping ff is bijective if ff is injective and surjective

Linear Mappings

Linear Mapping

Linear mapping if the following properties are valid:

  • Additivity: u,vE:f(u+v)=f(u)+f(v)\forall u,v \exists E:f(u+v)=f(u)+f(v)
  • Homogeneity: λK\forall\lambda \in K and vE:f(λv)=λf(v)\forall v\in E :f(\lambda v)= \lambda f(v)

(This happens very very rarely)

Affine Mapping

Said affine if $ g(v) = f(v) - f(u)$ is linear

Linear Mappings

Image of UU through ff, f(U)f(U) is the set f(U)={wFuUf(u)=w}f(U)=\{w\in F | \exist u \in U \ni`f(u)=w\} Follows that the triple (f(u),+,.)(f(u),+,.) is a vectors subspace of (F,+,.)(F,+,.)

Inverse Image

EWFE\to W\subset F The inverse image of WW through ff, indicated with f1(w)f^{-1}(w) is a set defined as: f1w={uEf(u)W}f^{-1}w=\{u\in E|f(u)\in W\}

Matrix Representation

Linear mapping can be expressed as the product of a matrix by a vector y=f(x)=Axy=f(x)=Ax

Image from a matrix

The mapping y=f(x)y=f(x) is expressed as a matrix equation y=Axy=Ax. Follows that the image of the mapping Im(f)Im(f) is spanned by the column vectors of the matrix A: Im(f)=L(a1,a2,...an)Im(f)=L(a^1,a^2,...a^n) where A=(a1,a2,...an)A=(a^1,a^2,...a^n)

(Just convert matrix into (A). Columns into own (C))

Endomorphisms and Kernel

Endomorphism

EFE\to F. If E=FE=F, f:EEf:E\to E then linear mapping is endomorphism

Null Mapping

O:EFO:E \to F is a mapping defined as vE:O(v)=OF\forall v \in E: O(v) = O_F

Identity Mapping

(Should be same dimension) I:EFI:E\to F is a mapping defined as vE:I(v)=v\forall v\in E: I(v)=v

Matrix Representation

EEE\to E be endomorphism. Mapping of multiplication of a square matrix by a vector: f(x):Axf(x):Ax

y=f(X)=Axy=f(X)=Ax. The inverse function x=f1(y)=A1yx=f^{-1}(y)=A^{-1}y

Linear dependence

Needs to be endomorphism v1...v_1... likely dependent then so are f(v)...f(v)...

Kernal

EFE\to F linear mapping ker(f)={vEf(v)=oFker(f)=\{v\in E| f(v) = o_F

Kernal as Vector Space

The triple (Ker(f),+,.)(Ker(f),+,.) is a vector subspace of (E,+,.)(E,+,.)

Kernal and Injection

f:EFf:E\to F be a linear mapping u,vEu,v\in E. Follows that f(u)=f(v)f(u)=f(v) if and only if uvKer(f)u-v\in Ker(f)

Theorem

Mapping is injective if and only if: Ker(f)={oe}Ker(f)=\{o_e\}

Linear Independence and injection

EFE\to F V1.....V_1..... be nn linearly independent vectors E\in E. If ff is injective then f(v1)...f(v_1)... are also linearly independent vectors of ff Endomorphism ff is invertible if and only if it is injective